13 research outputs found

    SHAPE FROM FOCUS USING LULU OPERATORS AND DISCRETE PULSE TRANSFORM IN THE PRESENCE OF NOISE

    Get PDF
    A study of three dimension (3D) shape recovery is an interesting and challenging area of research. Recovering the depth information of an object from normal two dimensional (2D) images has been studied for a long time with different techniques. One technique for 3D shape recovery is known as Shape from Focus (SFF). SFF is a method that depends on different focused values in reconstructing the shape, surface, and depth of an object. The different focus values are captured by taking different images for the same object by varying the focus length or varying the distance between object and camera. This single view imaging makes the data gathering simpler in SFF compared to other shape recovery techniques. Calculating the shape of the object using different images with different focused values can be done by applying sharpness detection methods to maximize and detect the focused values. However, noise destroys many information in an image and the result of noise corruption can change the focus values in the images. This thesis presents a new 3D shape recovery technique based on focus values in the presence of noise. The proposed technique is based on LULU operators and Discrete Pulse Transform (DPT). LULU operators are nonlinear rank selector operators that hold consistent separation, total variation and shape preservation properties. The proposed techniques show better and more accurate performance in comparison with the existing SFF techniques in noisy environment

    Online Signature Verification using SVD Method

    Get PDF
    Online signature verification rests on hypothesis which any writer has similarity among signature samples, with scale variability and small distortion. This is a dynamic method in which users sign and then biometric system recognizes the signature by analyzing its characters such as acceleration, pressure, and orientation. The proposed technique for online signature verification is based on the Singular Value Decomposition (SVD) technique which involves four aspects: I) data acquisition and preprocessing 2) feature extraction 3) matching (classification), 4) decision making. The SVD is used to find r-singular vectors sensing the maximal energy of the signature data matrix A, called principle subspace thus account for most of the variation in the original data. Having modeled the signature through its r-th principal subspace, the authenticity of the tried signature can be determined by calculating the average distance between its principal subspace and the template signature. The input device used for this signature verification system is 5DT Data Glove 14 Ultra which is originally design for virtual reality application. The output of the data glove, which captures the dynamic process in the signing action, is the data matrix, A to be processed for feature extraction and matching. This work is divided into two parts. In part I, we investigate the performance of the SVD-based signature verification system using a new matching technique, that is, by calculating the average distance between the different subspaces. In part IJ, we investigate the performance of the signature verification with reducedsensor data glove. To select the 7-most prominent sensors of the data glove, we calculate the F-value for each sensor and choose 7 sensors that gives the highest Fvalue

    Monitoring of lung cancer patients during radiotherapy using combined texture and level set analysis of CBCT images

    Get PDF
    In the UK, radiotherapy (RT) contributes to a large amount of lung cancer treatment while its imaging information is limited to computed tomography (CT) and cone beam CT (CBCT) images. The oncologists defines the gross tumour volume (GTV) manually on the planning-CT images before any treatment starts. Manual contouring suffers from many disadvantages and the bad quality of CBCT images makes it very challenging for the clinicians to observe tumour behaviour in the time of treatment. CBCT is the only kind of image available throughout the whole course of RT which is used in the mechanical procedure of adjusting patient position before starting each session of treatment and is not generally used by clinicians for monitoring the tumour. The goal of this thesis is to develop a tumour detection model of non-small cell lung tumours on CBCT images in the course of treatment. By developing this process clinicians will be greatly aided in their role, helping them to detect lung tumours to allow better diagnosis and improving patient treatment outcome. Therefore a new segmentation approach is proposed as combined texture analysis and level set model. It has the potential capability to track the variation of the tumour shape over time of treatment solely using CBCT images, and evaluate the accountability of RT for different patients. The texture analysis, second-order statistics obtained from gray level co-occurrence matrices (GLCM), highlight the tumour boundary and help Chan-Vese and Li level set models convergence in the segmentation process. Further on a new parallel level sets model is proposed by combining Chan-Vese and Li models in the concept of vector-valued image level set. This new approach overcomes the difficulties in the parameter settings of current models by giving more freedom of choice in tuning parameters as well as selecting level set models. All proposed models were evaluated on the dataset of fifty different patients suffered from non-small cell lung cancer. For the validation procedure, qualitative analysis was carried out by an oncologist as there is no ground truth in each CBCT image during RT. The decision of the oncologist based on patient history has proven the results of this work. For quantitative analysis, the Dice coefficient is used to evaluate the tumour segmentation results on CBCT compared to GTV on CT images prior to treatment to evaluate the amount of changes especially after one third of RT on CBCT #10. Additionally, the proposed segmentation models had the accuracy of almost 90% to the GTV delineated by the oncologist for the only one patient in the dataset having GTV on CBCT images which proved the ability of these models for further analysis during the absence of GTV on CBCTs. For improving this research and helping the clinicians at most, the proposed segmentation model can be used as a notification model to assist clinicians for a better understanding of the tumour during RT and subsequent use in offline adaptive radiotherapy (ART)

    SHAPE FROM FOCUS USING LULU OPERATORS AND DISCRETE PULSE TRANSFORM IN THE PRESENCE OF NOISE

    Get PDF
    A study of three dimension (3D) shape recovery is an interesting and challenging area of research. Recovering the depth information of an object from normal two dimensional (2D) images has been studied for a long time with different techniques. One technique for 3D shape recovery is known as Shape from Focus (SFF). SFF is a method that depends on different focused values in reconstructing the shape, surface, and depth of an object. The different focus values are captured by taking different images for the same object by varying the focus length or varying the distance between object and camera. This single view imaging makes the data gathering simpler in SFF compared to other shape recovery techniques. Calculating the shape of the object using different images with different focused values can be done by applying sharpness detection methods to maximize and detect the focused values. However, noise destroys many information in an image and the result of noise corruption can change the focus values in the images. This thesis presents a new 3D shape recovery technique based on focus values in the presence of noise. The proposed technique is based on LULU operators and Discrete Pulse Transform (DPT). LULU operators are nonlinear rank selector operators that hold consistent separation, total variation and shape preservation properties. The proposed techniques show better and more accurate performance in comparison with the existing SFF techniques in noisy environment

    Online Signature Verification using SVD Method

    Get PDF
    Online signature verification rests on hypothesis which any writer has similarity among signature samples, with scale variability and small distortion. This is a dynamic method in which users sign and then biometric system recognizes the signature by analyzing its characters such as acceleration, pressure, and orientation. The proposed technique for online signature verification is based on the Singular Value Decomposition (SVD) technique which involves four aspects: I) data acquisition and preprocessing 2) feature extraction 3) matching (classification), 4) decision making. The SVD is used to find r-singular vectors sensing the maximal energy of the signature data matrix A, called principle subspace thus account for most of the variation in the original data. Having modeled the signature through its r-th principal subspace, the authenticity of the tried signature can be determined by calculating the average distance between its principal subspace and the template signature. The input device used for this signature verification system is 5DT Data Glove 14 Ultra which is originally design for virtual reality application. The output of the data glove, which captures the dynamic process in the signing action, is the data matrix, A to be processed for feature extraction and matching. This work is divided into two parts. In part I, we investigate the performance of the SVD-based signature verification system using a new matching technique, that is, by calculating the average distance between the different subspaces. In part IJ, we investigate the performance of the signature verification with reducedsensor data glove. To select the 7-most prominent sensors of the data glove, we calculate the F-value for each sensor and choose 7 sensors that gives the highest Fvalue

    Online Signature Verification using SVD Method

    No full text
    Online signature verification rests on hypothesis which any writer has similarity among signature samples, with scale variability and small distortion. This is a dynamic method in which users sign and then biometric system recognizes the signature by analyzing its characters such as acceleration, pressure, and orientation. The proposed technique for online signature verification is based on the Singular Value Decomposition (SVD) technique which involves four aspects: 1) data acquisition and preprocessing 2) feature extraction 3) matching (classification), 4) decision making. The SVD is used to find r-singular vectors sensing the maximal energy of the signature data matrix A, called principle subspace thus account for most of the variation in the original data. Having modeled the signature through its r-th principal subspace. the authenticity of the tried signature can be determined by calculating the average distance between its principal subspace and the template signature
    corecore